منابع مشابه
Maximum-throughput dynamic network flows
This paper presents and solves the maximum throughput dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which the flow on each arc not only has an associated upper and lower bound but also an associated transit time. Flow is to be sent through the network in each period so as to satisfy...
متن کاملPoComON∗ A POlicy-COMpliant Overlay Network
On today’s commodity internet, senders have no control over the path that their packets take beyond the first hop. This aspect of today’s internet prevents many potential network policies from being implemented. Source routing has been proposed as a mechanism to solve this problem, in which the sender chooses the path the traffic will take. However, previous approaches have either not enforced ...
متن کاملIncremental Network Design with Maximum Flows
We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flowover the entire planning horizon. After presenting twomixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prov...
متن کاملNetwork flows Lecturer : Michel Goemans 1 The maximum flow problem
In this network we have two special vertices: a source vertex s and a sink vertex t. Our goal is to send the maximum amount of flow from s to t; flow can only travel along arcs in the right direction, and is constrained by the arc capacities. This “flow” could be many things: imagine sending water along pipes, with the capacity representing the size of the pipe; or traffic, with the capacity be...
متن کاملMaximum Skew-Symmetric Flows
We introduce the maximumskew-symmetric ow problem which generalizes ow and matching problems. We develop a theory of skew-symmetric ows that is parallel to the classical ow theory. We use the newly developed theory to extend, in a natural way, the blocking ow method of Dinitz to the skew-symmetric ow case. In the special case of the skew-symmetric ow problem that corresponds to cardinality matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9050863